Light Spanners in Bounded Pathwidth Graphs
نویسندگان
چکیده
In approximation algorithm design, light spanners has applications in graph-metric problems such as metric TSP (the traveling salesman problem) [8] and others [3]. We have developed an efficient algorithm in [9] for light spanners in bounded pathwidth graphs, based on an intermediate data structure called monotone tree. In this paper, we extended the results to include bounded catwidth graphs.
منابع مشابه
Finding Light Spanners in Bounded Pathwidth Graphs
Given an edge-weighted graph G and > 0, a (1+ )-spanner is a spanning subgraph G′ whose shortest path distances approximate those of G within a factor of 1+ . For G from certain graph families (such as bounded genus graphs and apex graphs), we know that light spanners exist. That is, we can compute a (1+ )-spanner G′ with total edge weight at most a constant times the weight of a minimum spanni...
متن کاملLight spanners for bounded treewidth graphs imply light spanners for $H$-minor-free graphs
Grigni and Hung [10] conjectured that H-minor-free graphs have (1 + )-spanners that are light, that is, of weight g(|H|, ) times the weight of the minimum spanning tree for some function g. This conjecture implies the efficient polynomial-time approximation scheme (PTAS) of the traveling salesperson problem in H-minor free graphs; that is, a PTAS whose running time is of the form 2f( )nO(1) for...
متن کاملCollective Tree Spanners in Graphs with Bounded Genus, Chordality, Tree-Width, or Clique-Width
In this paper we study collective additive tree spanners for special families of graphs including planar graphs, graphs with bounded genus, graphs with bounded tree-width, graphs with bounded cliquewidth, and graphs with bounded chordality. We say that a graph G = (V,E) admits a system of μ collective additive tree r-spanners if there is a system T (G) of at most μ spanning trees of G such that...
متن کاملComputing Bounded Path Decompositions in Logspace
The complexity of Graph Isomorphism (GI) is a long-standing open problem. GI is not known to be solvable in polynomial time and is unlikely to be NP-complete [BHZ87, Sch88]. Polynomial-time algorithms are known for GI of several special classes of graphs. One such interesting class is graphs excluding a fixed minor. Any family of graphs that is closed under taking minors falls into this class. ...
متن کاملCrossing Number for Graphs with Bounded~Pathwidth
The crossing number is the smallest number of pairwise edge-crossings when drawing a graph into the plane. There are only very few graph classes for which the exact crossing number is known or for which there at least exist constant approximation ratios. Furthermore, up to now, general crossing number computations have never been successfully tackled using bounded width of graph decompositions,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012